Concurrent solution of WATC scheduling with WPPW due date assignment for environmentally weighted customers, jobs and services using SA and its hybrid
نویسندگان
چکیده
منابع مشابه
Due-date assignment and parallel-machine scheduling with deteriorating jobs
In this paper we study the problem of scheduling n deteriorating jobs on m identical parallel machines. Each job’s processing time is a nondecreasing function of its start time. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of the due-date, earliness and tardiness penalties. We show that this problem is NP-hard, and we present a heuris...
متن کاملMinimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
In this paper, an integrated due date assignment, and delivery scheduling of order for multi customer for make to order production system in supply chain has been survered. One manufacture received n orders from K customers. The due date of orders for each customer is common and manufacture can assign the due dates with a related cost. Orders must be process by one machine and send to customers...
متن کاملScheduling Jobs and a Variable Maintenance on a Single Machine with Common Due-Date Assignment
We investigate a common due-date assignment scheduling problem with a variable maintenance on a single machine. The goal is to minimize the total earliness, tardiness, and due-date cost. We derive some properties on an optimal solution for our problem. For a special case with identical jobs we propose an optimal polynomial time algorithm followed by a numerical example.
متن کاملA note on due-date assignment and single-machine scheduling with deteriorating jobs
We study a scheduling problem with deteriorating jobs, i.e., jobs whose processing times are an increasing function of their start times. We consider the case of a single machine and linear job-independent deterioration. The problem is to determine an optimal combination of the due date and schedule so as to minimize the sum of due-date, earliness and tardiness penalties. We give an O(n logn) t...
متن کاملA unified solution approach for the due date assignment problem with tardy jobs
We analyze a number of due date assignment problems with the weighted number of tardy jobs objective and show that these problems can be solved in O(n) time by dynamic programming. We show that the effects of learning or the effects of past-sequence-dependent setup times can be incorporated into the problem formulation at no additional computational cost. We also show that some single-machine d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Periodicals of Engineering and Natural Sciences (PEN)
سال: 2019
ISSN: 2303-4521
DOI: 10.21533/pen.v6i2.186